Salutation for Péter Somlai

Péter Major

This paper discusses an interesting result of Lata la [3] about the tail behaviour of Gaussian polynomials. I found it useful to present a new, more detailed version of Lata la’s rather concise proof by putting emphasis on its main ideas. I applied several ideas of the original work, but introduced some different arguments as well. I tried to explain the method of the proof by discussing the pi...

A Prize as a Salutation

My first encounter with Professor William Bynum was in 1998, as I waited with much nervousness in the corridors outside the lecture theatre at the Wellcome Institute for the History of Medicine. A greeting and encouragement, both provided in a booming voice, was just what a young research fellow, keen to impress in what was widely regarded as a mecca of learning, required. My seminar was comple...

Subwords in reverse - complement order - Extended abstract ∗ Péter

We examine finite words over an alphabet Γ = {a, ā; b, b̄} of pairs of letters, where each word w1w2...wt is identified with its reverse complement w̄t...w̄2w̄1 (where ā = a, b̄ = b). We seek the smallest k such that every word of length n, composed from Γ, is uniquely ∗This work was supported, in part, by Hungarian NSF, under contract Nos. AT48826, NK62321, F043772, N34040, T34702, T37846, T43758, ...

Theorems af Péter and Parsons in Computer Programming

Péter Major On the estimation of multiple random integrals and U - statistics – Lecture